TSTP Solution File: SEV228^5 by Vampire-SAT---4.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Vampire-SAT---4.8
% Problem  : SEV228^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s

% Computer : n029.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Sun May  5 09:44:53 EDT 2024

% Result   : Theorem 0.15s 0.32s
% Output   : Refutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   29 (   4 unt;  13 typ;   0 def)
%            Number of atoms       :  150 (  35 equ;   0 cnn)
%            Maximal formula atoms :    8 (   9 avg)
%            Number of connectives :   53 (  21   ~;   8   |;  14   &;   0   @)
%                                         (   0 <=>;  10  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   5 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   32 (  31   >;   1   *;   0   +;   0  <<)
%            Number of symbols     :   16 (  13 usr;   3 con; 0-6 aty)
%            Number of variables   :   31 (   0   ^  15   !;  10   ?;  31   :)
%                                         (   6  !>;   0  ?*;   0  @-;   0  @+)

% Comments : 
%------------------------------------------------------------------------------
thf(type_def_5,type,
    a: $tType ).

thf(type_def_6,type,
    sTfun: ( $tType * $tType ) > $tType ).

thf(func_def_0,type,
    a: $tType ).

thf(func_def_1,type,
    cS: a > $o ).

thf(func_def_5,type,
    sK0: a ).

thf(func_def_6,type,
    sK1: ( a > $o ) > a ).

thf(func_def_7,type,
    kCOMB: 
      !>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).

thf(func_def_8,type,
    bCOMB: 
      !>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).

thf(func_def_9,type,
    vAND: $o > $o > $o ).

thf(func_def_10,type,
    vOR: $o > $o > $o ).

thf(func_def_11,type,
    vIMP: $o > $o > $o ).

thf(func_def_12,type,
    vNOT: $o > $o ).

thf(func_def_13,type,
    vEQ: 
      !>[X0: $tType] : ( X0 > X0 > $o ) ).

thf(f61,plain,
    $false,
    inference(subsumption_resolution,[],[f60,f11]) ).

thf(f11,plain,
    $true = vAPP(a,$o,cS,sK0),
    inference(cnf_transformation,[],[f10]) ).

thf(f10,plain,
    ( ! [X1: a > $o] :
        ( ( $true != vAPP(a,$o,X1,sK0) )
        | ( ( $true != vAPP(a,$o,cS,vAPP(sTfun(a,$o),a,sK1,X1)) )
          & ( $true = vAPP(a,$o,X1,vAPP(sTfun(a,$o),a,sK1,X1)) ) ) )
    & ( $true = vAPP(a,$o,cS,sK0) ) ),
    inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1])],[f7,f9,f8]) ).

thf(f8,plain,
    ( ? [X0: a] :
        ( ! [X1: a > $o] :
            ( ( vAPP(a,$o,X1,X0) != $true )
            | ? [X2: a] :
                ( ( vAPP(a,$o,cS,X2) != $true )
                & ( vAPP(a,$o,X1,X2) = $true ) ) )
        & ( vAPP(a,$o,cS,X0) = $true ) )
   => ( ! [X1: a > $o] :
          ( ( $true != vAPP(a,$o,X1,sK0) )
          | ? [X2: a] :
              ( ( vAPP(a,$o,cS,X2) != $true )
              & ( vAPP(a,$o,X1,X2) = $true ) ) )
      & ( $true = vAPP(a,$o,cS,sK0) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f9,plain,
    ! [X1: a > $o] :
      ( ? [X2: a] :
          ( ( vAPP(a,$o,cS,X2) != $true )
          & ( vAPP(a,$o,X1,X2) = $true ) )
     => ( ( $true != vAPP(a,$o,cS,vAPP(sTfun(a,$o),a,sK1,X1)) )
        & ( $true = vAPP(a,$o,X1,vAPP(sTfun(a,$o),a,sK1,X1)) ) ) ),
    introduced(choice_axiom,[]) ).

thf(f7,plain,
    ? [X0: a] :
      ( ! [X1: a > $o] :
          ( ( vAPP(a,$o,X1,X0) != $true )
          | ? [X2: a] :
              ( ( vAPP(a,$o,cS,X2) != $true )
              & ( vAPP(a,$o,X1,X2) = $true ) ) )
      & ( vAPP(a,$o,cS,X0) = $true ) ),
    inference(ennf_transformation,[],[f6]) ).

thf(f6,plain,
    ~ ! [X0: a] :
        ( ( vAPP(a,$o,cS,X0) = $true )
       => ? [X1: a > $o] :
            ( ( vAPP(a,$o,X1,X0) = $true )
            & ! [X2: a] :
                ( ( vAPP(a,$o,X1,X2) = $true )
               => ( vAPP(a,$o,cS,X2) = $true ) ) ) ),
    inference(fool_elimination,[],[f5]) ).

thf(f5,plain,
    ~ ! [X0: a] :
        ( vAPP(a,$o,cS,X0)
       => ? [X1: a > $o] :
            ( vAPP(a,$o,X1,X0)
            & ! [X2: a] :
                ( vAPP(a,$o,X1,X2)
               => vAPP(a,$o,cS,X2) ) ) ),
    inference(rectify,[],[f2]) ).

thf(f2,negated_conjecture,
    ~ ! [X0: a] :
        ( vAPP(a,$o,cS,X0)
       => ? [X1: a > $o] :
            ( vAPP(a,$o,X1,X0)
            & ! [X2: a] :
                ( vAPP(a,$o,X1,X2)
               => vAPP(a,$o,cS,X2) ) ) ),
    inference(negated_conjecture,[],[f1]) ).

thf(f1,conjecture,
    ! [X0: a] :
      ( vAPP(a,$o,cS,X0)
     => ? [X1: a > $o] :
          ( vAPP(a,$o,X1,X0)
          & ! [X2: a] :
              ( vAPP(a,$o,X1,X2)
             => vAPP(a,$o,cS,X2) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cTHM91A_pme) ).

thf(f60,plain,
    $true != vAPP(a,$o,cS,sK0),
    inference(trivial_inequality_removal,[],[f59]) ).

thf(f59,plain,
    ( ( $true != vAPP(a,$o,cS,sK0) )
    | ( $true != $true ) ),
    inference(boolean_simplification,[],[f54]) ).

thf(f54,plain,
    ( ( $true != vAPP(a,$o,cS,sK0) )
    | ( $true != vAPP(a,$o,vAPP(a,sTfun(a,$o),vEQ(a),sK0),sK0) ) ),
    inference(superposition,[],[f13,f42]) ).

thf(f42,plain,
    sK0 = vAPP(sTfun(a,$o),a,sK1,vAPP(a,sTfun(a,$o),vEQ(a),sK0)),
    inference(leibniz_equality_elimination,[],[f12]) ).

thf(f12,plain,
    ! [X1: a > $o] :
      ( ( $true != vAPP(a,$o,X1,sK0) )
      | ( $true = vAPP(a,$o,X1,vAPP(sTfun(a,$o),a,sK1,X1)) ) ),
    inference(cnf_transformation,[],[f10]) ).

thf(f13,plain,
    ! [X1: a > $o] :
      ( ( $true != vAPP(a,$o,cS,vAPP(sTfun(a,$o),a,sK1,X1)) )
      | ( $true != vAPP(a,$o,X1,sK0) ) ),
    inference(cnf_transformation,[],[f10]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09  % Problem    : SEV228^5 : TPTP v8.1.2. Released v4.0.0.
% 0.02/0.10  % Command    : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.30  % Computer : n029.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 300
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Fri May  3 12:25:22 EDT 2024
% 0.10/0.30  % CPUTime    : 
% 0.10/0.30  % (20895)Running in auto input_syntax mode. Trying TPTP
% 0.15/0.32  % (20896)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.32  % (20898)dis-2_2:3_amm=sco:anc=none:bce=on:fsr=off:gsp=on:nm=16:nwc=1.2:nicw=on:sac=on:sp=weighted_frequency_476 on theBenchmark for (476ds/0Mi)
% 0.15/0.32  % (20901)dis+11_4:5_nm=4_216 on theBenchmark for (216ds/0Mi)
% 0.15/0.32  % (20900)dis+1_20_av=off:lcm=predicate:nm=2:nwc=2.0_396 on theBenchmark for (396ds/0Mi)
% 0.15/0.32  % (20902)fmb+10_1_fmbas=off:fmbsr=1.3:nm=2:si=on:rtra=on:rawr=on:rp=on:fmbksg=on_1451 on theBenchmark for (1451ds/0Mi)
% 0.15/0.32  % (20899)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3:gsp=on:nm=4_470 on theBenchmark for (470ds/0Mi)
% 0.15/0.32  % (20898)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.32  % Exception at run slice level
% 0.15/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.32  % (20899)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.15/0.32  % Exception at run slice level
% 0.15/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs% Exception at run slice level
% 0.15/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.32  
% 0.15/0.32  % (20897)fmb+10_1_bce=on:fmbas=expand:fmbksg=on:fmbsr=1.3_569 on theBenchmark for (569ds/0Mi)
% 0.15/0.32  % Exception at run slice level
% 0.15/0.32  User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.15/0.32  % (20900)First to succeed.
% 0.15/0.32  % (20898)Also succeeded, but the first one will report.
% 0.15/0.32  % (20901)Also succeeded, but the first one will report.
% 0.15/0.32  % (20900)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-20895"
% 0.15/0.32  % (20900)Refutation found. Thanks to Tanya!
% 0.15/0.32  % SZS status Theorem for theBenchmark
% 0.15/0.32  % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.32  % (20900)------------------------------
% 0.15/0.32  % (20900)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.15/0.32  % (20900)Termination reason: Refutation
% 0.15/0.32  
% 0.15/0.32  % (20900)Memory used [KB]: 762
% 0.15/0.32  % (20900)Time elapsed: 0.005 s
% 0.15/0.32  % (20900)Instructions burned: 5 (million)
% 0.15/0.32  % (20895)Success in time 0.005 s
%------------------------------------------------------------------------------